#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=1e5+1000;
typedef long long LL;
const LL mod=1e9+7;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
LL dp[maxn][8];
char s[maxn];
char p[9]={"chokudai"};
int main(void){
   	cin.tie(0);std::ios::sync_with_stdio(false);
    cin>>(s+1);LL n=strlen(s+1);
    for(LL i=1;i<=n;i++){
        for(LL j=0;j<8;j++){
            dp[i][j]=dp[i-1][j]%mod;
            if(s[i]==p[j]){
                if(j==0){
                    dp[i][0]=(dp[i][0]+1)%mod;
                }
                else{
                    dp[i][j]=(dp[i][j]%mod+dp[i-1][j-1]%mod)%mod;
                }
            }
        }
    }
//    for(LL i=1;i<=n;i++){
//        for(LL j=0;j<8;j++){
//            cout<<dp[i][j]<<" ";
//        }cout<<endl;
//    }
    cout<<dp[n][7]%mod<<"\n";
    return 0;
}
